Pre-filtering 2D Polygons without Clipping

نویسندگان

  • Zhouchen Lin
  • Hai-Tao Chen
  • Heung-Yeung Shum
  • Jian Wang
چکیده

In this paper, an improved algorithm for pre-filtering 2D polygons is presented. The part of the polygon within the mask of a filter is decomposed into basic component regions whose parameters can be easily computed. Given the parameters, the integral of the filter over the basic component region can be looked up from a table or even be computed with a closed-form solution. The integral or its negative is then added to the accumulation buffer of the pixel according to whether the pixel center is outside the component region or not. After traveling all polygon edges, the accumulation buffers are shifted by integers so that they are all between 0 and 1. In this way, the expensive clipping of the polygons against the filter mask becomes unnecessary.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Polynomial Filters

In this paper, we present a family of circular or square optimal polynomial filters for pre-filtering 2D polygons and images. The criterion of designing polynomial filters is to maximize the energy concentration within a period of the spectra of the filters. The filters are non-negative and can have arbitrary radius and order. For a given radius, the filters converge very fast when the order in...

متن کامل

Hardware Implementation of PAPR Reduction with Clipping and Filtering Technique for Mobile Applications

Abstract-Orthogonal frequency division multiplexing (OFDM) is preferred for mobile communications applications due to its increased data transmission capability. At one hand, it has advantages of being robust to multipath fading and possessing high data rate transmission capability, on the other hand it suffers from high peak to average power ratio (PAPR). In this paper FPGA implementation of c...

متن کامل

An Edge Labeling Approach to Concave Polygon Clipping

This paper describes an algorithm to perform clipping of two possibly concave polygons. The approach labels the edges of the input polygons. This labeling is used in classifying the resulting polygons in the sets A \ B, A n B and B n A. It is shown that its worst-case time complexity is not worse than the worst-case complexity of the problem of polygon clipping itself. Suggestions are made how ...

متن کامل

Prefiltering Two-Dimensional Polygons without Clipping

In this paper, an improved algorithm for prefiltering two-dimensional polygons is presented. The part of the polygon within the mask of a filter is decomposed into basic component regions whose parameters can be easily computed. Given the parameters, the integral of the filter over the basic component region can be looked up from a table or even be computed with a closed-form solution. The inte...

متن کامل

Overlapping Area Computation between Irregular Polygons for Its Evolutionary Layout Based on Convex Decomposition

Low efficiency of interference calculation has become the bottleneck that restricts further development of the performance of evolutionary algorithm for the polygon layout. To solve the problem, in this paper, we propose an algorithm of calculating overlapping area between two irregular polygons. For this algorithm, at first, two irregular polygons are respectively decomposed into the minimum n...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004